On Hamiltonian cycles and Hamiltonian paths

نویسندگان

  • Mohammad Sohel Rahman
  • Mohammad Kaykobad
چکیده

A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths. The significance of the theorems is discussed, and it is shown that the famous Ore’s theorem directly follows from our result.  2004 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the mutually independent Hamiltonian cycles in faulty hypercubes

Two ordered Hamiltonian paths in the n-dimensional hypercube Qn are said to be independent if i-th vertices of the paths are distinct for every 1 ≤ i ≤ 2n. Similarly, two s-starting Hamiltonian cycles are independent if i-th vertices of the cycle are distinct for every 2 ≤ i ≤ 2n. A set S of Hamiltonian paths and sstarting Hamiltonian cycles are mutually independent if every two paths or cycles...

متن کامل

Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes

This paper addresses the existence and construction of Hamiltonian paths and Hamiltonian cycles on conforming tetrahedral meshes. The paths and cycles are constrained to pass from one tetrahedron to the next one through a vertex. For conforming tetrahedral meshes, under certain conditions which are normally satisfied in finite-element computations, we show that there exists a through-vertex Ham...

متن کامل

Edge-disjoint Hamiltonian Paths and Cycles in Tournaments

We describe sufficient conditions for the existence of Hamiltonian paths in oriented graphs and use these to provide a complete description of the tournaments with no two edge-disjoint Hamiltonian paths. We prove that tournaments with small irregularity have many edge-disjoint Hamiltonian cycles in support of Kelly's conjecture.

متن کامل

On Hamiltonian alternating cycles and paths

We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same type of questions as those for the plane case...

متن کامل

Hamiltonian Paths and Cycles in Planar Graphs

We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nαn) upper bound and an Ω(αn) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices, where α ≈ 1.46557 is the unique real root of α = α + 1. For any positive integer n ≥ 6, we define an outerplanar ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 94  شماره 

صفحات  -

تاریخ انتشار 2005